@InProceedings{FariasScheCombVelh:2005:BoOpSu,
               author = "Farias, Marcus A. C. and Scheidegger, Carlos E. and Comba, 
                         Jo{\~a}o L. D. and Velho, Luiz Carlos Pacheco Rodrigues",
          affiliation = "Instituto de Inform{\'a}tica, UFRGS and Scientific Computing and 
                         Imaging Institute, University of Utah and {Instituto de 
                         Matem´atica Pura e Aplicada}",
                title = "Boolean operations on surfel-bounded objects using constrained 
                         BSP-trees",
            booktitle = "Proceedings...",
                 year = "2005",
               editor = "Rodrigues, Maria Andr{\'e}ia Formico and Frery, Alejandro 
                         C{\'e}sar",
         organization = "Brazilian Symposium on Computer Graphics and Image Processing, 18. 
                         (SIBGRAPI)",
            publisher = "IEEE Computer Society",
              address = "Los Alamitos",
             keywords = "BSP-trees, Boolean operations, opera{\c{c}}{\~o}es Booleanas, 
                         surfel.",
             abstract = "Point-based modeling and rendering is an active area of research 
                         in Computer Graphics. The concept of points with attributes (e.g. 
                         normals) is usually referred to as surfels, and many algorithms 
                         have been devised to their efficient manipulation and rendering. 
                         Key to the efficiency of many methods is the use of partitioning 
                         schemes, and usually axis-aligned structures such as octrees and 
                         KD-trees are preferred, instead of more general BSP-trees. In this 
                         work we introduce a data structure called Constrained BSPtree 
                         (CBSP-tree) that can be seen as an intermediate structure between 
                         KD-trees and BSP-trees. The CBSP-tree is characterized by allowing 
                         arbitrary cuts as long as the complexity of its cells remains 
                         bounded, allowing better approximation of curved regions. We 
                         discuss algorithms to build CBSP-trees using the flexibility that 
                         the structure offers, and present a modified algorithm for boolean 
                         operations that uses a new inside-outside object classification. 
                         Results show that CBSP-trees generate fewer cells than axisaligned 
                         structures.",
  conference-location = "Natal, RN, Brazil",
      conference-year = "9-12 Oct. 2005",
                  doi = "10.1109/SIBGRAPI.2005.17",
                  url = "http://dx.doi.org/10.1109/SIBGRAPI.2005.17",
             language = "en",
                  ibi = "6qtX3pFwXQZeBBx/GKsqL",
                  url = "http://urlib.net/ibi/6qtX3pFwXQZeBBx/GKsqL",
           targetfile = "fariasm_constrained_bsp.pdf",
        urlaccessdate = "2024, May 03"
}